Abstract state machines: verification problems and computational power
نویسنده
چکیده
State Machines: Verification Problems and Computational Power Von der Fakultät für Mathematik, Informatik und Naturwissenschaften der Rheinisch-Westfälischen Technischen Hochschule Aachen zur Erlangung des akademischen Grades einer Doktorin der Naturwissenschaften genehmigte Dissertation
منابع مشابه
Abstract State Machines: Verification Problems and Complexity Dissertation
State Machines: Verification Problems and Complexity
متن کاملAbstract state machines: verification problems and complexity
State Machines: Verification Problems and Complexity Von der Fakultät für Mathematik, Informatik und Naturwissenschaften der Rheinisch-Westfälischen Technischen Hochschule Aachen zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften genehmigte Dissertation vorgelegt von Diplom-Informatiker Marc Spielmann aus Duisburg Referent: Universitätsprofessor Dr. E. Grädel Koreferent...
متن کاملAutomatic Parametric Verification of Root Contention Protocol based on Abstract State Machines and First Order Timed Logic
The paper presents a verification of the IEEE Root Contention Protocol as an illustration of a new and innovative approach for the verification of real-time distributed systems. Systems are modeled with basic Gurevich abstract state machines (ASMs), and requirements are expressed in a first order timed logic (FOTL). FOTL is undecidable, however the protocol we study is in a decidable class of p...
متن کاملAutomatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic
The paper presents a verification of the IEEE Root Contention Protocol as an illustration of a new and innovative approach for the verification of real-time distributed systems. Systems are modeled with basic Gurevich abstract state machines (ASMs), and requirements are expressed in a first order timed logic (FOTL). FOTL is undecidable, however the protocol we study is in a decidable class of p...
متن کاملModel Checking and Refinement of ASM Models Using SMV
Gurevich’s Abstract State Machines (ASMs) are computational models of systems specified in a high level language (ASM-SL). In this paper, we investigate the pros and cons of the automatic verification of ASM models using the ASM-Workbench and its extention ASM-SMV, which supports computer-aided verification by model checking. The results obtained are based on the validation and verification of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004